Jordan Journal of Mathematics and Statistics (JJMS) 3(3), 2010, ppAN EXTENSION OF MULHOLLAND’S INEQUALITY BICHENG YANG Abstract. By introducing multi-parameters and using the way of weight coefficients and

Source URL: journals.yu.edu.jo

• Logic
• Computability theory
• Curry–Howard correspondence
• Logic in computer science
• Philosophy of computer science
• Type theory
• Symbol
• Mathematical logic
• Mathematics
• Proof theory

Sample Complexity of Classiers Taking Values in RQ, Application to Multi-Class SVMs Yann Guermeur LORIA-CNRS Campus Scientique, BPVand÷uvre-lès-Nancy Cedex, France

Source URL: www.loria.fr

• Statistical classification
• Support vector machine
• Group action
• Computability theory
• Abstract algebra
• Mathematics
• Algebra

Feasible analysis, randomness, and base invariance Santiago Figueira Andr´e Nies March 26, 2014

Source URL: www.glyc.dc.uba.ar

• Computability theory
• Theory of computation
• Game theory
• Martingale
• Martingale theory
• Normal distribution
• Symbol
• Normal number
• Computable function
• Mathematics
• Statistics
• Theoretical computer science

The Halting Problems of Network Stack Insecurity Le n S a s s a m a n , M e r e d i t h L . P a t t e r s o n , Se r g e y B r a t u s , and Anna Shubina Len Sassaman was a PhD

Source URL: langsec.org

• Computability theory
• Models of computation
• Turing machine
• Theory of computation
• Turing completeness
• Halting problem
• Universal Turing machine
• Parsing
• Deterministic pushdown automaton
• Theoretical computer science
• Computer science
• Applied mathematics

Modal properties of recursively defined commands Paul Blain Levy, University of Birmingham And {s.As }s∈A∗ means: A recent paper (“Seeing Beyond Divergence”,

Source URL: www.cs.bham.ac.uk

• Models of computation
• Order theory
• Philosophical logic
• Computability theory
• Equivalence relation
• Lambda calculus
• Preorder
• Modal logic
• Denotational semantics
• Mathematics
• Logic
• Mathematical logic

Randomness and Universal Machines Santiago Figueira∗ Frank Stephan† Guohua Wu‡

Source URL: www.glyc.dc.uba.ar

• Computer science
• Turing machine
• Formal methods
• Models of computation
• Turing degree
• Recursively enumerable set
• Computability
• Μ-recursive function
• Lambda calculus
• Computability theory
• Theoretical computer science
• Theory of computation

Security Applications of Formal Language Theory Dartmouth Computer Science Technical Report TR2011-709 Len Sassaman, Meredith L. Patterson, Sergey Bratus, Michael E. Locasto, Anna Shubina

Source URL: langsec.org

• Mathematics
• Deterministic pushdown automaton
• Parsing
• Computability
• Context-free grammar
• Context-free language
• Formal grammar
• Finite-state machine
• Recursive language
• Formal languages
• Theoretical computer science
• Theory of computation

Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Source URL: www.paultaylor.eu

• Theory of computation
• Mathematical logic
• General topology
• Functional analysis
• Computable number
• Computable function
• Continuous function
• Baire space
• Topological space
• Computability theory
• Mathematics
• Topology

A Self-Hosting Evaluator using HOAS A Scheme Pearl Eli Barzilay Northeastern University

Source URL: schemeworkshop.org

• Lambda calculus
• Recursion
• Subroutines
• Computability theory
• Theoretical computer science
• Higher-order abstract syntax
• Fixed-point combinator
• Scheme
• Continuation-passing style
• Software engineering
• Computing
• Computer programming

Constructive Computation Theory G´ erard Huet An executable computability theory course based on λ-calculus

Source URL: cristal.inria.fr